Lempel-Ziv Factorization: LZ77 without Window

To construct the su x array of a string S boils down to sorting all su xes of S in lexicographic order (also known as alphabetical order, dictionary order, or lexical order). This order is induced by an order on the alphabet Σ. In this manuscript, Σ is an ordered alphabet of constant size σ. It is sometimes convenient to regard Σ as an array of size σ so that the characters appear in ascending order in the array Σ[1..σ], i.e., Σ[1] < Σ[2] < · · · < Σ[σ]. Conversely, each character in Σ is mapped to a number in {1, . . . , σ}. The smallest character is mapped to 1, the second smallest character is mapped to 2, and so on. In this way, we can use a character as an index for an array.